Bitwise Logical Operations in VCMA-MRAM

نویسندگان

چکیده

Today’s technology demands compact, portable, fast, and energy-efficient devices. One approach to making devices is an in-memory computation that addresses the memory bottleneck issues of present computing system by utilizing a spintronic device viz. magnetic tunnel junction (MTJ). Further, area energy can be reduced through approximate computation. We circuit design based on logic-in-memory paradigm voltage-controlled anisotropy magnetoresistive random access (VCMA-MRAM). During computation, multiple bit cells within array are selected in parallel activating word lines. The designed performs all logic operations-Read/NOT, AND/NAND, OR/NOR, arithmetic SUM operation (1-bit adder with 75% accuracy for accurate carry out) slight modification using control signals. All simulations have been performed at 45 nm CMOS node VCMA-MTJ compact model HSPICE simulator. Simulation results show proposed circuit’s consumes about 300% less 2.3 times faster than its counterpart exact adder.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bitwise Operations under RAMBO

In this paper we study the problem of computing w-bit bitwise operations using only O(1) memory probes. We show that under the RAM model there exists a Ω(2) space lower bound while under the RAMBO model this space bound goes down to O(w) bits. We present algorithms that use four different RAMBO memory topologies to perform bitwise boolean operations and shift operations.

متن کامل

The Synchronization Power of Atomic Bitwise Operations

In a distributed system, processes must reach a certain level of synchronization to solve a common problem. The strongest form of synchronization can be reached through consensus: all the processes must agree on a common value that has been proposed by one of them. Consensus is universal in shared memory systems: any type of shared object can be implemented using it. Unfortunately, consensus is...

متن کامل

Bitwise Operations Based Encryption and Decryption

In this paper, variable block length based character/bit level transformation has been proposed for encryption and decryption, where a block of characters /few bits has taken into account. The originated text is transformed into decimal values and passed to encoder module. In this module values are cluttered using binary operations present in most systems with keys. This routine is based on fei...

متن کامل

Enforcing Arc Consistency using Bitwise Operations

In this paper, we propose to exploit bitwise operations to speed up some important computations such as looking for a support of a value in a constraint, or determining if a value is substitutable by another one. Considering a computer equipped with a x-bit CPU, one can then expect an increase of the performance by a coefficient up to x (which may be important, since x is equal to 32 or 64 in m...

متن کامل

The bitwise operations in relation to obtaining Latin squares

This article outlines some techniques for the use of bitwise operations in programming languages C/C++ and Java. As an example, we describe an algorithm for receiving a Latin square of arbitrary order.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11182805